A computational study and survey of methods for the single-row facility layout problem
نویسندگان
چکیده
منابع مشابه
A computational study and survey of methods for the single-row facility layout problem
The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular facilities so as to minimize the ove...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملA polyhedral approach to the single row facility layout problem
The Single Row Facility Layout Problem (SRFLP) is the NP -hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heurist...
متن کاملSingle-Row Equidistant Facility Layout as a Special Case of Single-Row Facility Layout
In this paper we discuss two particular layout problems, namely the Single-Row Equidistant Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP). Our aim is to consolidate the two respective branches in the layout literature. We show that the (SREFLP) is not only a special case of the Quadratic Assignment Problem but also a special case of the (SRFLP). This new con...
متن کاملa hybrid simulated annealing algorithm for single row facility layout problem
this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2012
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-012-9505-8